DENGRIS-Stream: A Density-Grid based Clustering Algorithm for Evolving Data Streams over Sliding Window
نویسندگان
چکیده
Evolving data streams are ubiquitous. Various clustering algorithms have been developed to extract useful knowledge from evolving data streams in real time. Density-based clustering method has the ability to handle outliers and discover arbitrary shape clusters whereas grid-based clustering has high speed processing time. Sliding window is a widely used model for data stream mining due to its emphasis on recent data and its limited memory requirement. In this paper, we propose a new framework for density grid-based clustering algorithm using sliding window model. The algorithm is called DENGRIS-Stream (a DENsity GRId-based algorithm for clustering data streams over Sliding window). It discovers the arbitrary shape clusters in limited time and memory. The DENGRIS-Stream algorithm has an online component which maps each data record to a density grid in each sliding window. The offline component adjusts the clusters by removing sparse grids and merging the neighboring dense grids. Keywords—Evolving Data Stream, Density-grid based Clustering, Sliding Window Model
منابع مشابه
Probability Density Grid-based Online Clustering for Uncertain Data Streams
Most existing stream clustering algorithms adopt the online component and offline component. The disadvantage of two-phase algorithms is that they can not generate the final clusters online and the accurate clustering results need to be got through the offline analysis. Furthermore, the clustering algorithms for uncertain data streams are incompetent to find clusters of arbitrary shapes accordi...
متن کاملMining Frequent Patterns in Uncertain and Relational Data Streams using the Landmark Windows
Todays, in many modern applications, we search for frequent and repeating patterns in the analyzed data sets. In this search, we look for patterns that frequently appear in data set and mark them as frequent patterns to enable users to make decisions based on these discoveries. Most algorithms presented in the context of data stream mining and frequent pattern detection, work either on uncertai...
متن کاملLeaDen-Stream: A Leader Density-Based Clustering Algorithm over Evolving Data Stream
Clustering evolving data streams is important to be performed in a limited time with a reasonable quality. The existing micro clustering based methods do not consider the distribution of data points inside the micro cluster. We propose LeaDen-Stream (Leader Density-based clustering algorithm over evolving data Stream
متن کاملMuDi-Stream: A multi density clustering algorithm for evolving data stream
Density-based method has emerged as a worthwhile class for clustering data streams. Recently, a number of density-based algorithms have been developed for clustering data streams. However, existing density-based data stream clustering algorithms are not without problem. There is a dramatic decrease in the quality of clustering when there is a range in density of data. In this paper, a new metho...
متن کاملA Data Stream Clustering Algorithm Based Extension of Grid and Density
This study focuses on the summary data structure design and optimize the method of calculation of the mesh density and how to effectively deal with the problem of boundary points, combined with the sliding window mechanism and suggest improvements based on the mesh density of the data stream real-time clustering algorithm framework and the various parts of concrete realization of the algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013